Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Cross-modal person re-identification relation network based on dual-stream structure
Yubin GUO, Xiang WEN, Pan LIU, Ximing LI
Journal of Computer Applications    2023, 43 (6): 1803-1810.   DOI: 10.11772/j.issn.1001-9081.2022050665
Abstract246)   HTML10)    PDF (1787KB)(104)       Save

In visible-infrared cross-modal person re-identification, the modal differences will lead to low identification accuracy. Therefore, a dual-stream structure based cross-modal person re-identification relation network, named IVRNBDS (Infrared and Visible Relation Network Based on Dual-stream Structure), was proposed. Firstly, the dual-stream structure was used to extract the features of the visible light modal and the infrared modal person images respectively. Then, the feature map of the person image was divided into six segments horizontally to extract relationships between the local features of each segment and the features of other segments of the person and the relationship between the core features and average features of the person. Finally, when designing loss function, the Hetero-Center triplet Loss (HC Loss) function was introduced to relax the strict constraints of the ordinary triplet loss function, so that image features of different modals were able to be better mapped into the same feature space. Experimental results on public datasets SYSU-MM01 (SunYat-Sen University MultiModal re-identification) and RegDB (Dongguk Body-based person Recognition) show that the computational cost of IVRNBDS is slightly higher than those of the mainstream cross-modal person re-identification algorithms, but the proposed network has the Rank-1 (similarity Rank 1) and mAP (mean Average Precision) improved compared to the mainstream algorithms, increasing the recognition accuracy of the cross-modal people re-identification algorithm.

Table and Figures | Reference | Related Articles | Metrics
Hybrid genetic ant colony algorithm for traveling salesman problem
Jing-Rong XU Yun LI Hai-Tao LIU Pan LIU
Journal of Computer Applications   
Abstract2457)      PDF (704KB)(3166)       Save
A new Heuristic Genetic Information based Ant Colony Genetic Algorithm (HGI-ACGA) to solve Traveling Salesman Problems(TSP) was proposed. HGIACGA’s two sub-algorithms are Ant Colony Genetic Algorithm(ACGA) and Heuristic Genetic Information based Ant Colony Algorithm(HGI-ACA). ACGA enhances genetic algorithm’s population diversity and reduces the search domain, while HGIACA eliminates the creation of invalid tours and also avoids depending on pheromone excessively. A combination of genetic information and pheromone leads to a significant improvement in performance. The strategy of HGI-ACGA algorithm can improve convergence rate and capacity of searching optimal solution. Experimental results show that the proposed algorithm generally exhibits a better solution and a higher rate of convergence for TSP than ACGA and ACA.
Related Articles | Metrics